Tailoring customer order scheduling search algorithms
نویسندگان
چکیده
منابع مشابه
Customer order scheduling on a single machine with family setup times: Complexity and algorithms
We consider a situation where C customers each order various quantities (possibly zero in some cases) of products from P different families, which can be produced on a continuously available machine in any sequence (requiring a setup whenever production switches from one family to another). We assume that the time needed for a setup depends only on the family to be produced immediately after it...
متن کاملCustomer Order Scheduling with Job-Based Processing and Lot Streaming In A Two-Machine Flow Shop
This paper considers a customer order scheduling (COS) problem in which each customer requests a variety of products processed in a two-machine flow shop. A sequence-independent attached setup for each machine is needed before processing each product lot. We assume that customer orders are satisfied by the job-based processing approach in which the same products from different customer orders f...
متن کاملCustomer Order Scheduling to Minimize Total Weighted Completion Time
In this paper we study the scheduling problem in which each customer order consists of several jobs of different types, which are to be processed on m facilities. Each facility is dedicated to the processing of only one type of jobs. All jobs of an order have to be delivered to the customer at the same time. The objective is to schedule all the orders to minimize the total weighted order comple...
متن کاملOrder Scheduling Models: Hardness and Algorithms
We consider scheduling problems in which a job consists of components of different types to be processed on m machines. Each machine is capable of processing components of a single type. Different components of a job are independent and can be processed in parallel on different machines. A job is considered as completed only when all its components have been completed. We study both completion ...
متن کاملSecond Order Behavior of Pattern Search Algorithms
Abstract: Previous analyses of pattern search algorithms for unconstrained and linearly constrained minimization have focused on proving convergence of a subsequence of iterates to a limit point satisfying either directional or first-order necessary conditions for optimality, depending on the smoothness of the objective function in a neighborhood of the limit point. Even though pattern search m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Operations Research
سال: 2019
ISSN: 0305-0548
DOI: 10.1016/j.cor.2019.04.015